Regular Language
Q31.
Let P be a regular language and Q be a context free language such that Q \subseteq P. (For example, let P be the language represented by the regular expression p*q* and Q be \{p^{n}q^{n}|n\in N\} Then which of the following is ALWAYS regular?Q32.
Let L \subseteq \{0,1\}^* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states?Q33.
Let L \subseteq \Sigma^* where \Sigma = \left\{a,b \right\}. Which of the following is true?Q34.
If L_{1}=\{a^{n}|n\geq 0\} and L_{2}=\{b^{n}|n\geq 0 \}, Consider (I) L_{1}\cdot L_{2} is a regular language (II) L_{1} \cdot L_{2}= \{a^{n}b^{n}|n \geq 0\} Which one of the following is CORRECT?Q36.
Consider the following statements. I. If L_1\cup L_2 is regular, then both L_1 \; and \; L_2 must be regular. II. The class of regular languages is closed under infinite union. Which of the above statements is/are TRUE?Q38.
Consider the following two statements : S1: {0^{2n}|n\geq 1|} is a regular language S2 : {0^{m}1^{n}0^{m+n}|m\geq 1 and n\geq 1|} is a regular language Which of the following statements is correct?Q39.
Consider the following two statements about regular languages: S1: Every infinite regular language contains an undecidable language as a subset. S2: Every finite language is regular. Which one of the following choices is correct?Q40.
Let L be a regular language. Consider the constructions on L below: I. \text{repeat} (L) = \{ww \mid w \in L\} II. \text{prefix} (L) = \{u \mid \exists v : uv \in L\} III. \text{suffix} (L) = \{v \mid \exists u: uv \in L\} IV. \text{half} (L) = \{u \mid \exists v: | v | = | u | \text{ and } uv \in L\}Which of the constructions could lead to a non-regular language?